A short proof of the Buchstaber–Rees theorem
نویسندگان
چکیده
منابع مشابه
A short proof of Harsanyi's purification theorem
A short and more general proof of Harsanyi’s puri...cation theorem is provided through an application of a powerful, yet intuitive, result from algebraic topology.
متن کاملA different short proof of Brook's theorem
Lovász gave a short proof of Brooks’ theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case.
متن کاملA Short Proof of Zheludev's Theorem
We give a short proof of Zheludev's theorem that states the existence of precisely one eigenvalue in sufficiently distant spectral gaps of a Hill operator subject to certain short-range perturbations. As a by-product we simultaneously recover Rofe-Beketov's result about the finiteness of the number of eigenvalues in essential spectral gaps of the perturbed Hill operator. Our methods are operato...
متن کاملA Short Proof of McDougall's Circle Theorem
This note offers a short, elementary proof of a result similar to Ptolemy’s theorem. Specifically, let di,j denote the distance between Pi and Pj . Let n be a positive integer and Pi, for 1 ≤ i ≤ 2n, be cyclically ordered points on a circle. If Ri := ∏ 1 ≤ j ≤ 2n j 6= i di,j , then n ∑
متن کاملA short proof of König's matching theorem
We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover. c © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 138–139, 2000
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2011
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2010.0310